The two smallest minimal blocking sets of Q ( 2 n , 3 ) , n > 3
نویسنده
چکیده
We describe the two smallest minimal blocking sets of Q(2n, 3), n > 3. To obtain these results, we use the characterization of the smallest minimal blocking sets of Q(6, 3), different from an ovoid. We also present some geometrical properties of ovoids of Q(6, q), q odd.
منابع مشابه
Characterization results on small blocking sets
In [8], De Beule and Storme characterized the smallest blocking sets of the hyperbolic quadrics Q+(2n + 1, 3), n ≥ 4; they proved that these blocking sets are truncated cones over the unique ovoid of Q+(7, 3). We continue this research by classifying all the minimal blocking sets of the hyperbolic quadrics Q+(2n + 1, 3), n ≥ 3, of size at most 3n + 3n−2. This means that the three smallest minim...
متن کاملOn the smallest minimal blocking sets of Q(2n, q), for q an odd prime
We characterize the smallest minimal blocking sets of Q(2n, q), q an odd prime, in terms of ovoids of Q(4, q) and Q(6, q). The proofs of these results are written for q = 3, 5, 7 since for these values it was known that every ovoid of Q(4, q) is an elliptic quadric. Recently, in [2], it has been proven that for all q prime, every ovoid of Q(4, q) is an elliptic quadric. Since as many proofs as ...
متن کاملThe use of blocking sets in Galois geometries and in related research areas
Blocking sets play a central role in Galois geometries. Besides their intrinsic geometrical importance, the importance of blocking sets also arises from the use of blocking sets for the solution of many other geometrical problems, and problems in related research areas. This article focusses on these applications to motivate researchers to investigate blocking sets, and to motivate researchers ...
متن کاملOn the Linearity of Higher-Dimensional Blocking Sets
A small minimal k-blocking set B in PG(n, q), q = pt, p prime, is a set of less than 3(qk + 1)/2 points in PG(n, q), such that every (n − k)-dimensional space contains at least one point of B and such that no proper subset of B satisfies this property. The linearity conjecture states that all small minimal k-blocking sets in PG(n, q) are linear over a subfield Fpe of Fq. Apart from a few cases,...
متن کاملOn the Smallest Minimal Blocking Sets in Projective Space Generating the Whole Space
It was conjectured that the smallest minimal point sets of PG(2s, q), q a square, that meet every s-subspace and that generate the whole space are Baer subgeometries PG(2s, √ q). This was shown in 1971 by Bruen for s = 1, and by Metsch and Storme [5] for s = 2. Our main interest in this paper is to prepare a possible proof of this conjecture by proving a strong theorem on line-blocking sets in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004